Grammatical codes of trees

Grammatical Inference Using Suffix Trees

The goal of the Alignment-Based Learning (ABL) grammatical inference framework is to structure plain (natural language) sentences as if they are parsed according to a context-free grammar. The framework produces good results even when simple techniques are used. However, the techniques used so far have computational drawbacks, resulting in limitations with respect to the amount of language data...

Inducing Sequentiality Using Grammatical Genetic Codes

This paper studies the inducement of sequentiality in genetic algorithms (GAs) for uniformly-scaled problems. Sequentiality is a phenomenon in which sub-solutions converge sequentially in time in contrast to uniform convergence observed for uniformly-scaled problems. This study uses three different grammatical genetic codes to induce sequentiality. Genotypic genes in the grammatical codes are i...

A left part theorem for grammatical trees

We consider a global property of the derivation (or parse) trees of context-free grammars. This property of the derivation trees of context-free grammars can be considered as a restricted version of the left part property for the trees of strict deterministic grammars [3,4,5,6]. In this paper it is shown that this left part property is satisfied by the set of grammatical trees of a left pati gr...

Prefix codes, trees and automata

We inv~stigate-the relations be'·"'h.",pn the tree representation of a prefix code C, its patterns, the minimal automaton ~ * whi.ch recognizes C and the homomorphic images of the underlying algebra of ::G'. These relations provide us with an appealing formulation which allows us to state (and eventually solve) some problems concerning the structure of prefix codes and therefore the structure o...

1-identifying Codes on Trees